Subject: QoS Capacity Estimates

From: OLIVER H <[email-masked]>
Date: Thu, 10 Jul 1997 17:25:57 +0100

I'm looking for pointers to QoS capacity estimation algorithms.

Part of the ReTINA project (http://www.chorus.com/Research/retina.html) has the problem
of producing a QoS capacity estimate for subnetworks with typically half a dozen
boundary nodes. This estimate will later be used by a QoS-based routing algorithm. The
complete topology information is known for the subnetwork and also available are
bandwidth, error and delay figures for each node and link. Complete analysis of the
subnetwork is too costly so what we want is an algorithm to generate a small number
of paths between each pair of boundary nodes. We can then aggregate over each path to get
an end to end figure. We expect to look at paths in a shortest-first order (although that
is not necessary).

Thanks in advance for any suggestions or pointers,
Huw.
=================================================
Huw Oliver,
SECAM Building,
Lancaster University,
Lancaster,
LA1 5QB.
Tel: 01524 593798
e-mail: [email-masked]